Small Universal Networks of Evolutionary Processors
نویسندگان
چکیده
In this article we consider universal networks of evolutionary processors (NEP) having a small number of rules. We show that it is possible to construct a universal NEP with 5 rules when no input/output encoding is used, and a universal NEP with 4 rules in the case in which such an encoding is allowed. We also give a construction of a universal NEP with 7 rules that efficiently (in polynomial time) simulates any Turing machine.
منابع مشابه
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections
In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computation...
متن کاملAccepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in practice, we propose in this paper three network topologies that restrict the communication: star networks, ring networks, and grid networks. We show that ring-AHNEPs can simulate 2-tag systems, thus we deduce the existe...
متن کاملObligatory Hybrid Networks of Evolutionary Processors
In this paper obligatory hybrid networks of evolutionary processors (a variant of hybrid networks of evolutionary processors model) are proposed. In the obligatory hybrid network of evolutionary processors a node discards the strings to which no operations are applicable. We show that such networks have the same computability power as Turing machines only using one operation per node (deletion ...
متن کاملOn Small Accepting Networks of Evolutionary Processors with Regular Filters
We show that every context-sensitive language can be accepted by an accepting network of non-increasing evolutionary processors with one substitution processor and one output node whose communication is controlled by regular languages. Every recursively enumerable language can be accepted by a network with three evolutionary processors: one substitution processor, one insertion processor and on...
متن کاملOn the size complexity of hybrid networks of evolutionary processors
The goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about the size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 19 شماره
صفحات -
تاریخ انتشار 2014